Run-time Adaptation of Grid Data Placement Jobs
نویسندگان
چکیده
Grid presents a continuously changing environment. It also introduces a new set of failures. The data grid initiative has made it possible to run data-intensive applications on the grid. Data-intensive grid applications consist of two parts: a data placement part and a computation part. The data placement part is responsible for transferring the input data to the compute node and the result of the computation to the appropriate storage system. While work has been done on making computation adapt to changing conditions, little work has been done on making the data placement adapt to changing conditions. In this work, we have developed an infrastructure which observes the environment and enables run-time adaptation of data placement jobs. We have enabled Stork, a scheduler for data placement jobs in heterogeneous environments like the grid, to use this infrastructure and adapt the data placement job to the environment just before execution. We have also added dynamic protocol selection and alternate protocol fall-back capability to Stork to provide superior performance and fault tolerance.
منابع مشابه
Toward an Interactive Grid Adaptive Resource Broker
This paper presents an approach used as a basis for interactive system adaptation in which Grid jobs are maintained at runtime. Most of the Grid research on Resource Broker assumes that the broker’s task, other than monitoring the job status, is over once the job has been submitted, i.e. the user submits the job to the broker or the scheduler and simply waits for the results. So far little atte...
متن کاملJobs Run-Time Scheduling in a Java Based Grid Architecture
Grid computing provides infrastructure for solving distributed problem by sharing, selection and aggregation of distributed resources at runtime depending on their availability, performance, cost and user’s quality of service requirements. Utilization of this powerful technology is mainly conditioned by tricky management of different architectures and environments and by the difficulty to ident...
متن کاملA study of dynamic data placement for ATLAS distributed data management
This contribution presents a study on the applicability and usefulness of dynamic data placement methods for data-intensive systems, such as ATLAS distributed data management (DDM). In this system the jobs are sent to the data, therefore having a good distribution of data is significant. Ways of forecasting workload patterns are examined which then are used to redistribute data to achieve a bet...
متن کاملA New Job Scheduling in Data Grid Environment Based on Data and Computational Resource Availability
Data Grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. The heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. Most existing scheduling algorithms in Grids only focus on one kind of Grid jobs which can be data...
متن کاملMapping of Independent Task Classes onto GRIDSIM
The motivation of Grid computing is to aggregate the power of widely distributed resources, and provide non-trivial services to users. To achieve this goal, an efficient Grid scheduling System is an essential part of the Grid. Rather than covering the whole Grid scheduling area, this survey provides a review of the subject mainly from the perspective of scheduling algorithms. In this review, th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Scalable Computing: Practice and Experience
دوره 6 شماره
صفحات -
تاریخ انتشار 2005